Deterministic process logic is elementary
نویسندگان
چکیده
منابع مشابه
Computation Paths Logic: An Expressive, yet Elementary, Process Logic
A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of Harel. Kozen and Parikh. and is close in spirit to the logic R of Hare1 and Peleg. It enjoys most of the advantages of previous process logics. yet is decidable in elementary tlmc. We also ofrcr ext...
متن کاملLinear Logic & Elementary Time
Think of elementary linear logic as an idealized functional programming language with a severe typing mechanism. Definition by recursion is, of course, forbidden, but some sort of iteration still is possible and the purpose of this paper is to show that enough computing power remains so that elementary recursive functions can be implemented. Actually, the whole paper can be considered an exerci...
متن کاملNon Deterministic Logic Programs
Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially observable Markov decision processes, and conditional planning. We present a logic programming framework called non deterministic logic programs, along with a decl...
متن کاملDeterministic Bayesian Logic
In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. This logic is shown to be non-trivial and is not reduced to classical propositions. The Bayesian conditional of DBL implies...
متن کاملLinear logic and elementary time
A subsystem of linear logic, elementary linear logic, is defined and shown to represent exactly elementary recursive functions. Its choicest part consists in reducing the deductive power of the exponential, also known as the ‘‘bang,’’ which, in linear logic, is in charge of controlling duplication in the cut-elimination process. 2003 Elsevier Science (USA). All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1983
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(83)80025-4